Computational problems - PDFSEARCH.IO - Document Search Engine

Computational problems
Results: 809

#	Item
51	CS 224d: Assignment #3 Due date: :59 PM PST (You are allowed to use three (3) late days maximum for this assignment) This handout consists of several homework problems, as well as instructions on the “deliverabl Add to Reading List Source URL: cs224d.stanford.edu Language: English - Date: 2016-06-01 01:35:27 Computer programming Software engineering Computing Recursion Artificial neural network Computational neuroscience Mathematical psychology B-tree Tree Recurrent neural network
52	A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Takehide Soh1 , Katsumi Inoue12 , Naoyuki Tamura3 , Mutsunori Banbara3 , and Hidetomo Nabeshima4 1 Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2008-12-04 03:03:05 Theoretical computer science Computational complexity theory Mathematics Constraint programming Numerical software Automated theorem proving DPLL algorithm Packing problems Solver Constraint satisfaction Reduction Algorithm
53	Same bang, fewer bucks: efficient discovery of the cost-influence skyline Matthijs van Leeuwen∗ Abstract Antti Ukkonen† Add to Reading List Source URL: www.patternsthatmatter.org Language: English - Date: 2015-01-26 10:40:46 Mathematics Mathematical optimization Operations research Computational problems Submodular set function Pareto efficiency Algorithm Economics Optimization problem Applied mathematics
54	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:46:12 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization NP-hard problems Approximation algorithms Edsger W. Dijkstra Travelling salesman problem Nearest neighbour algorithm Shortest path problem Maximal independent set
55	Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:52 Mathematics Computational complexity theory Graph theory Analysis of algorithms NP-complete problems Probabilistic complexity theory Combinatorics Randomized algorithm Rejection sampling NP Independent set Poisson distribution
56	PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡ Add to Reading List Source URL: users.eecs.northwestern.edu Language: English - Date: 2009-09-15 22:21:32 Computational complexity theory Mathematics Theory of computation NP-complete problems Operations research Approximation algorithms Combinatorial optimization Set cover problem Linear programming relaxation Greedy algorithm Facility location problem Reduction
57	Capacity of Arbitrary Wireless Networks Olga Goussevskaia Roger Wattenhofer Computer Engineering and Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:24 Computational complexity theory Graph theory Mathematics NP-complete problems Combinatorial optimization NP-hard problems Graph coloring Signal-to-interference-plus-noise ratio NC Open set Independent set Matching
58	Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:56:36 Computational complexity theory Theory of computation Theoretical computer science NP-complete problems Complexity classes Logic in computer science Finite model theory Parameterized complexity Resolution Exponential time hypothesis Boolean satisfiability problem Conjunctive normal form
59	CS2101 Due: Tuesday 2nd of December 2014 Problem Set 3 CS2101 Add to Reading List Source URL: www.csd.uwo.ca Language: English - Date: 2014-11-27 12:00:09 Computational complexity theory Mathematics Theory of computation Operations research NP-hard problems Analysis of algorithms Asymptotic analysis Big O notation Mathematical notation NP Travelling salesman problem Gap reduction
60	Brief Bio and (PR)2: Problems & Pitches – Rants & Raves by Stephen Uzzo Current research interests include network science and ecosystems ecology, scientific visualization, cybernetics and epistemology. As Director, T Add to Reading List Source URL: vw.slis.indiana.edu Language: English - Date: 2008-03-31 13:53:06 Visualization Software Computational science Computer graphics Infographics Application software Communication design Cybernetics Network science VisIt Scientific visualization Big data